An expansion in the exponent for compound binomial approximations

The purpose of this paper is two-fold. First, we introduce a new asymptotic expansion in the exponent for the compound binomial approximation of the generalized Poisson binomial distribution. The dependence of its accuracy on the symmetry and shifting of distributions is investigated. Second, for compound binomial and compound Poisson distributions, we present new smoothness estimates, some of which contain explicit constants. Finally, the ideas used in this paper enable us to prove new precise bounds in the compound Poisson approximation. Published in Lietuvos Matematikos Rinkinys, Vol. 46, No. 1, pp. 67–110, January–March, 2006.     

Degree distribution of the greatest common divisor of polynomials over 𝔽q

We study the degree distribution of the greatest common divisor of two or more random polynomials over a finite field ??_q. We provide estimates for several parameters like number of distinct common irreducible factors, number of irreducible factors counting repetitions, and total degree of the gcd of two or more polynomials. We show that the limiting distribution of a random variable counting the total degree of the gcd is geometric and that the distributions of random variables counting the number of common factors (with and without repetitions) are very close to Poisson distributions when q is large. © 2005 Wiley Periodicals, Inc. Random Struct. Alg., 2006     

On irreversibility of von Neumann additive cellular automata on grids

The von Neumann cellular automaton appears in many different settings in Operations Research varying from applications in Formal Languages to Biology. One of the major questions related to it is to find a general condition for irreversibility of a class of two-dimensional cellular automata on square grids (σ⁺-automata). This question is partially answered here with the proposal of a sufficient condition for the irreversibility of σ⁺-automata.     

Asymptotic Behavior of Sobolev-Type Orthogonal Polynomials on a Rectifiable Jordan Curve or Arc

Our object of study is the asymptotic behavior of the sequence of polynomials orthogonal with respect to the discrete Sobolev inner product <formula> \langle f, g \rangle = ∈t_{E} f(ξ) \overline{g(ξ)} ρ(ξ) |d ξ|+ f(Z) A g(Z)^H, </formula> where E is a rectifiable Jordan curve or arc in the complex plane f(Z) = (f(z_1), \ldots, f^{(l_1)}(z_1) , \ldots , f(z_m) , \ldots ,f^{(l_m)}(z_m)), A is an M \times M Hermitian matrix, M l ₁ + ⋅s + l _m + m , |d ξ| denotes the arc length measure, ρ is a nonnegative function on E , and z _i ∈Ω, i=1,2,\ldots,m , where Ω is the exterior region to E . July 23, 1999. Dates revised: September 11, 2000 and February 16, 2001. Date accepted: February 26, 2001.     

近严格凸与最佳逼近

本文研究近严格凸与最佳逼近的关系．证明了Ｂａｎａｃｈ空间Ｘ是近严格凸的当且仅当Ｘ的每个子空间是紧－半－切比晓夫空间．     

一种拟Grünwald插值算子的L_p收敛速度

1引言 2006年3月 高等学校计算数学学报 设f(x)为卜1，1}上的连续函数，则以第二类Chebyshev多项式认(x)(Un(eoso)= 烈共坐)的全部零点{ 乙工工1口 式为 其中 k x无=Cos了一下丁7r 了L十1 犷_，为插值结点组的了的Gr如wald插值多项 G。(，，x)=艺了(x、)‘孟(x)， n. 11 一一 k     

A continuous function space with a Faber basis

Let be compact with #S=∞ and let C(S) be the set of all real continuous functions on S. We ask for an algebraic polynomial sequence (P_n)_n=0^∞ with deg P_n=n such that every fC(S) has a unique representation f=∑_i=0^∞ α_iP_i and call such a basis Faber basis. In the special case of , 0<q<1, we prove the existence of such a basis. A special orthonormal Faber basis is given by the so-called little q-Legendre polynomials. Moreover, these polynomials state an example with A(S_q)≠U(S_q)=C(S_q), where A(S_q) is the so-called Wiener algebra and U(S_q) is the set of all fC(S_q) which are uniquely represented by its Fourier series.     

A new algorithm for fixed design regression and denoising

In this paper, we present a new algorithm to estimate a regression function in a fixed design regression model, by piecewise (standard and trigonometric) polynomials computed with an automatic choice of the knots of the subdivision and of the degrees of the polynomials on each sub-interval. First we give the theoretical background underlying the method: the theoretical performances of our penalized least-squares estimator are based on non-asymptotic evaluations of a mean-square type risk. Then we explain how the algorithm is built and possibly accelerated (to face the case when the number of observations is great), how the penalty term is chosen and why it contains some constants requiring an empirical calibration. Lastly, a comparison with some well-known or recent wavelet methods is made: this brings out that our algorithm behaves in a very competitive way in term of denoising and of compression.     

微分多项式的值分布

文[2-6]讨论了亚纯函数或代数体函数的微分多项式ω‘(z)-αω^n(z)及ω（z)ω^n(z)的例外值问题。本文利用代数体函数的Nevanlinna值分布理论方法，研究了代数体函数的微分多项式P（ω^(k)(z))-aΠk=1^s(ω(z)-ak)^pk,及a(w^(k)(z)^tw^n(t)的Picard值问题，推广了他们的结果。